The theory of random graphs began in the late 1950s in several papers by Erdos and Renyi. In the late twentieth century, the notion of six degrees of separation, meaning that any two people on the planet can be connected by a short chain of people who know each other, inspired Strogatz and Watts to define the small world random graph in which each site is connected to k close neighbors, but also has long-range connections. At a similar time, it was observed in human social and sexual networks and on the Internet that the number of neighbors of an individual or computer has a power law distribution. This inspired Barabasi and Albert to define the preferential attachment model, which has these properties. These two papers have led to an explosion of research. The purpose of this book is to use a wide variety of mathematical argument to obtain insights into the properties of these graphs. A unique feature is the interest in the dynamics of process taking place on the graph in addition to their geometric properties, such as connectedness and diameter.

‘A very valuable addition to the growing field of random graphs, providing a systematic coverage of these novel models.’

Michael Krivelevich Source: Mathematical Reviews

‘The book is written in a friendly, chatty style, making it easy to read; I very much like that. In summary, Random Graph Dynamics is a nice contribution to the area of random graphs and a source of valuable insights.’

Malwina J. Luczak Source: Journal of the American Statistical Association